Solving Valid Syllogistic Problems using a Bidirectional Heteroassociative Memory

نویسندگان

  • Marie-France Hébert
  • Sylvain Chartier
  • Christophe Tremblay
چکیده

Classical syllogistic reasoning, also known as Aristotelian reasoning, is of particular interest in cognition. Such reasoning, which can seem simple at first, is known to be associated with high error rates. Although some research has been done on this topic, the underlying mechanisms used by human beings remain largely unknown. To understand the underlying cognitive properties associated with solving syllogistic problems, this study uses a connectionist approach composed of three steps inspired from Laird and Bara (1984): spatial representation, associative memory, and alternative searching conclusion. Results show that the network produces similar performances as humans.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive resonance associative map

-This article introduces a neural architecture termed Adaptive Resonance Associative Map ( ARAM) that extends unsupervised Adaptive Resonance Theory (ART) systems for rapid, yet stable, heteroassociative learning. ARAM can be visualized as two overlapping ART networks sharing a single category field. Although ARAM is simpler in architecture than another class o f supervised ART models known as ...

متن کامل

Encoding Static and Temporal Patterns with a Bidirectional Heteroassociative Memory

Brain-inspired, artificial neural network approach offers the ability to develop attractors for each pattern if feedback connections are allowed. It also exhibits great stability and adaptability with regards to noise and pattern degradation and can perform generalization tasks. In particular, the Bidirectional Associative Memory BAM model has shown great promise for pattern recognition for its...

متن کامل

Memory-Bounded Bidirectional Search

Previous approaches to bidirectional search require exponential space, and they are either less efficient than unidirectional search for finding optimal solutions, or they cannot even find such solutions for difficult problems. Based on a memory-bounded unidirectional algorithm for trees (SMA*), we developed a graph search extension, and we used it to construct a very efficient memory-bounded b...

متن کامل

Bi Directional Associative Memory Neural Network Method in the Character Recognition

Pattern recognition techniques are associated a symbolic identity with the image of the pattern. In this work we will analyze different neural network methods in pattern recognition. This problem of replication of patterns by machines (computers) involves the machine printed patterns. The pattern recognition is better known as optical pattern recognition. Since, it deals with recognition of opt...

متن کامل

Word recognition and incremental learning based on neural associative memories and hidden Markov models

An architecture for achieving word recognition and incremental learning of new words in a language processing system is presented. The architecture is based on neural associative memories and hidden Markov models. The hidden Markov models generate subword-unit transcriptions of the spoken words and provide them as input to the associative memory module. The associative memory module is a networ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014